Lexicographic and sequential equilibrium problems
نویسندگان
چکیده
The aim of this work is to analyze lexicographic equilibrium problems on a topological Hausdorff vector space X, and their relationship with some other vector equilibrium problems. Existence results for the tangled lexicographic problem are proved via the study of a related sequential problem. This approach was already followed by the same authors in the case of variational inequalities.
منابع مشابه
Well-posedness for Lexicographic Vector Equilibrium Problems
We consider lexicographic vector equilibrium problems in metric spaces. Sufficient conditions for a family of such problems to be (uniquely) well-posed at the reference point are established. As an application, we derive several results on well-posedness for a class of variational inequalities.
متن کاملSequential and quasi-perfect rationalizability in extensive games
Within an epistemic model for two-player extensive games, we formalize the event that each player believes that his opponent chooses rationally at all information sets. Letting this event be common certain belief yields the concept of sequential rationalizability. Adding preference for cautious behavior to this event likewise yields the concept of quasi-perfect rationalizability. These concepts...
متن کاملSequential Algorithms for Max-Min Fair Bandwidth Allocation
Telecommunication networks are facing the increasing demand for Internet services. Therefore, a problem of network dimensioning with elastic traffic arises which requires to allocate bandwidth to maximize service flows with fair treatment of all the services. In such applications, the so-called Max-Min Fairness (MMF) solution concept is widely used to formulate the resource allocation scheme. I...
متن کاملDealing with User’s Preferences in Mixed-Initiative Systems for Linear Optimization
Mixed-Initiative Systems (MIS) are hybrid decision systems where collaboration is possible between humans and machines. However, current systems sometimes override user preferences when provided with new ones. We studied linear optimization problems, where the decision maker is specifying preferences for variable values through an iterative process. We proposed a goal programming framework to d...
متن کاملEvolutionary stability and lexicographic preferences
We explore the interaction between evolutionary stability and lexicographic preferences. To do so, we define a limit Nash equilibrium for a lexicographic game as the limit of Nash equilibria of nearby games with continuous preferences. Nash equilibria of lexicographic games are limit Nash equilibria, but not conversely. Modified evolutionarily stable strategies (Binmore and Samuelson, 1992. J. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 46 شماره
صفحات -
تاریخ انتشار 2010